求解物流运输网络SUM-MIN双目标路径问题的扩展标号法

研究了物流运输网络SUM-MIN双目标路径问题. 基于模糊规划方法提出了一种求解SUM-MIN双目标路径问题的目标函数集成方法,以及集成后目标函数的扩展标号法. 在将双目标转化为单目标时,综合考虑了每个目标的边缘评价和两个目标的整体评价因素,通过对每个目标分配的权重将决策者的偏好充分体现到决策过程中,采用广义的模糊目标集成算子形成了相应的折衷规划模型. 最后,通过实例对所提方法进行了说明.     

制造企业成品出入库两级排队协同服务模型

优化企业成品出入库协同服务水平、平衡工作负荷,从而提高企业仓储服务效率、降低物流成本,是现代制造企业亟待解决的一个重要的管理细节问题。针对这个问题,本研究以仓储入库和出库两个排队过程为研究对象,建立出入库等待时间溢出情景下的两级排队协同服务模型,分析了在排队等待时间控制目标下,出入库员工优化配置方案。该模型引入溢出和串联两个协同服务机制,分三种情景即前方与后方服务台都有空闲,前方繁忙与后方空闲,前方空闲(或繁忙)与后方繁忙,建立了各情景下的系统状态转移方程,求解系统状态的概率,并进而推算出反映系统表现的各项指标,如员工使用率,队列长度,等待时间,以及等待时间超过溢出界值的概率。用制造企业成品出入库管理案例进行验证分析,对企业目前采用的M/M/S出入库排队系统与两级排队协同服务系统进行了数值计算对比。结果表明后者能有效提升出入库服务效率,减少出入库排队系统平均等待时间,降低由于入库和出库两个服务过程效率不均衡而产生的企业内部物流成本,是提升企业内部物流协同管理水平的一个重要方法。其应用可以服务于仓储出入库协同管理的信息化与自动化水平的提高。     

二级物流服务供应链的契约协调机制研究

研究一个物流服务集成商和一个物流服务提供商所组成的二级物流服务供应链的系统协调问题。分别建立了集中控制模型、批发价格契约下的Stackelberg主从协调模型、收益共享契约下的协调模型,得到不同协调方法下的最优解所满足的条件。通过模型间的对比,证明了收益共享契约可使得该物流服务供应链达到整体最优的状态,相对于批发价格契约,实现了Pareto改进。最后,用数值试验的方式进一步验证了收益共享契约在协调物流服务供应链运作的有效性。     

快递企业航空货运网络的构建

快递业竞争激烈,构建高效合理的航空货运网络是快递企业提高竞争力的重要手段。“枢纽—辐射”式航空货运网络是整合航空快递资源、提高航空快递资源利用效率、提高快递企业竞争力的有效模式。本文以降低航空快递网络成本、加快航空快递处理时间为目标,从航空快递网络枢纽的选取、指派关系的确定、枢纽个数的选择三个方面研究了航空快递网络模型建立问题,选用遗传算法求解不同枢纽个数下航空快递网络的运输成本,并据此进行枢纽的选取,运用重力模型法进行指派关系的确定,在此基础上运用超效率DEA模型确定枢纽个数。接着,以包含17个节点的顺丰航空快递网络的规划为例,对本文所提出的模型和算法进行了验证,验证结果证实了模型的合理性。本文的研究为快递企业构建航空货运网络提供了科学实用的方法,该方法的使用可以降低航空货运成本,提高效率,从而提高快递企业的竞争力。     

Collective Attack and Improvement on “Mediated Semi-Quantum Key Distribution Using Single Photons”

Lin et al. proposed a mediated semi-quantum key distribution protocol in 2019. This study shows that Lin et al.'s protocol has a security loophole that could mount to the collective attack to reveal some information about the secret key without being detected. To overcome this problem, an improved protocol is proposed and its security is proven.     

“第三方代管”参与下的共享单车回收路线优化问题

以共享单车回收为背景,研究了“第三方代管”参与下的回收路线优化问题。针对代管员和调度卡车的特征,提出激励代管员将零散分布的损坏单车运送至附近的中转点,然后派遣卡车将这些集中起来的损坏单车从中转点运送至维修中心。以总成本最小为目标建立混合整数规划模型,针对问题特性设计改进遗传算法。数值实验论证了问题特性,并论证得出在所提回收策略下及时回收损坏单车,不仅可以减轻公共空间被损坏单车挤占的问题,还可以有效减少回收成本。实验结果还表明所设计算法在短时间内能获得高质量解。     

Design and planning of supply chains with integration of reverse logistics activities under demand uncertainty

In this paper, a mixed integer linear programming (MILP) formulation is developed for the design and planning of supply chains with reverse flows while considering simultaneously production, distribution and reverse logistics activities. It is also considered products’ demand uncertainty using a scenario tree approach. As main goal the model defines the maximization of the expected net present value and the results provide details on sizing and location of plants, warehouses and retailers, definition of processes to install, establishment of forward and reverse flows and inventory levels to attain. The model is applied to a representative European supply chain case study and its applicability is demonstrated.     

Interval availability analysis of a two-echelon,multi-item system

In this paper we analyze the interval availability of a two-echelon, multi-item spare part inventory system. We consider a scenario inspired by a situation that we encountered at Thales Netherlands, a manufacturer of naval sensors and naval command and control systems. Modeling the complete system as a Markov chain we analyze the interval availability and we compute in closed and exact form the expectation and the variance of the availability during a finite time interval [0, T]. We use these characteristics to approximate the survival function using a Beta distribution, together with the probability that the interval availability is equal to one. Comparison of our approximation with simulation shows excellent accuracy, especially for points of the distribution function below the mean value. The latter points are practically most relevant.     

Joint-optimization of inventory policies on a multi-product multi-echelon pharmaceutical system with batching and ordering constraints

This paper presents a methodology to find near-optimal joint inventory control policies for the real case of a one-warehouse, n-retailer distribution system of infusion solutions at a University Medical Center in France. We consider stochastic demand, batching and order-up-to level policies as well as aspects particular to the healthcare setting such as emergency deliveries, required service level rates and a new constraint on the ordering policy that fits best the hospital’s interests instead of abstract ordering costs. The system is modeled as a Markov chain with an objective to minimize the stock-on-hand value for the overall system. We provide the analytical structure of the model to show that the optimal reorder point of the policy at both echelons is easily derived from a simple probability calculation. We also show that the optimal policy at the care units is to set the order-up-to level one unit higher than the reorder point. We further demonstrate that optimizing the care units in isolation is optimal for the joint multi-echelon, n-retailer problem. A heuristic algorithm is presented to find the near-optimal order-up-to level of the policy of each product at the central pharmacy; all other policy parameters are guaranteed optimal via the structure provided by the model. Comparison of our methodology versus that currently in place at the hospital showed a reduction of approximately 45% in the stock-on-hand value while still respecting the service level requirements.     

多储备点多品种应急物资配送的多目标优化模型

应急救援的社会化、应急物资需求的多样性、应急物资需求和补给的时变性,对应急物流的配送调度提出了挑战.应急物流的紧急性要求最大程度保障受灾点的物资供应;在经济上则要求应急物流的成本最小化.通过将时间离散化为阶段序列,在应急物资需求和补给是可预测的情况下,建立一个多储备点、多物资品种、单受灾点的应急物资配送的多目标优化模型,来最小化应急物资短缺次数和运输成本.仿真实例表明,该模型可以通过优化引擎快速求解,能够发现导致短缺的应急物资品种和加强供应补给的时间区间.